Path Allocation in Backbone Networks: Project Report

نویسنده

  • Markus Fidler
چکیده

Introduction There are two major frameworks for providing service guarantees in IP-based networks: The Integrated Services (IS) architecture and the Differentiated Services (DS) architecture. While the IS framework provides service guarantees using a flow-based packet differentiation, the DS architecture differentiates the treatment of aggregates. Though IS is able to provide strong Quality of Service (QoS) guarantees, its practical use suffers from significant scalability problems. The DS framework addresses this issue through its concept of aggregation. Packets are identified by simple markings that indicate the respective class. In the core of the network, routers do not need to determine to which flow a packet belongs, only which aggregate behavior has to be applied. Edge routers mark packets by setting the DS Code-Point (DSCP) and indicate whether they are within profile. If they are out of profile they might even be discarded by a dropper at the edge router. A particular marking on a packet indicates a so-called Per Hop Behavior (PHB) that has to be applied for forwarding the packet. The price for building aggregates is, however, a weaker control over the provisioned service parameters. The derivation of delay bounds remains a challenge, when providing a Premium Service. In [14] such bounds are derived for a general topology and a maximum load. However, these bounds can be improved, when additional information concerning the current load and the special topology of the DS domain is available. In [54], a central resource management for DS domains called Bandwidth Broker is presented. A Bandwidth Broker is a middleware service which controls and facilitates the dynamic access to network services of a particular administrative domain [31]. The task of a Bandwidth Broker in a DS domain is to perform a careful admission control, and to set up the appropriate configuration of the domain's edge routers, whereas the configuration of core routers remains static to allow for scalability. While doing so, the Bandwidth Broker knows about all service requests. Besides it can easily learn about the DS domains topology, either statically or by implementing a listener for the domains routing protocol. Thus, a Bandwidth Broker can have access to all information that is required, in order to base its admission control on delay bounds that are derived for the current load, and the special topology of the administrated domain. The particular challenge that arises here is to derive a set of formulas that can effectively be …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bicriteria Resource Allocation Problem in Pert Networks

We develop a bicriteria model for the resource allocation problem in PERT networks, in which the total direct costs of the project as the first objective, and the mean of project completion time as the second objective are minimized. The activity durations are assumed to be independent random variables with either exponential or Erlang distributions, in which the mean of each activity duration ...

متن کامل

A heuristic method for consumable resource allocation in multi-class dynamic PERT networks

This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a n...

متن کامل

A Multi Objective Fibonacci Search Based Algorithm for Resource Allocation in PERT Networks

The problem we investigate deals with the optimal assignment of resources to the activities of a stochastic project network. We seek to minimize the expected cost of the project include sum of resource utilization costs and lateness costs. We assume that the work content required by the activities follows an exponential distribution. The decision variables of the model are the allocated resourc...

متن کامل

On Robust Traffic Engineering in Core Networks

This paper reports on a probabilistic method for traffic engineering (specifically routing and resource allocation) in backbone networks, where the transport is the main service and robustness to the unexpected changes in network parameters is required. We analyze the network using the probabilistic betweenness of the network nodes (or links). The theoretical results lead to the definition of ”...

متن کامل

Quasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks

Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004